Optimized convergence for multiple histogram analysis
نویسندگان
چکیده
We propose a new algorithm for solving the Weighted Histogram Analysis Method (WHAM) equations to estimate free energies out of a set of Monte Carlo (MC) or Molecular Dynamics (MD) simulations. The algorithm, based on free energy differences, provides a more natural way of approaching the problem and improves convergence compared to the widely used direct iteration method. We also study how parameters (temperature, pressure, etc.) of the independent simulations should be chosen to optimize the accuracy of the set of free energies.
منابع مشابه
Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملOptimized Content based Image Retrieval System based on Multiple Feature Fusion AlgorithmL
Recent years have envisaged a sudden increase in the use of multimedia content like images and videos. This increase has created the problem of locating desired digital content from a very large multimedia database. This paper presents an optimized Content Based Image Retrieval (CBIR) system that uses multiple feature fusion and matching to retrieve images from a image database. Three features,...
متن کاملIterative exact global histogram specification and SSIM gradient ascent: a proof of convergence, step size and parameter selection
Alireza Avanaki [email protected] (my ID is my last name) Abstract The SSIM-optimized exact global histogram specification (EGHS) is shown to converge in the sense that the first order approximation of the result’s quality (i.e., its structural similarity with input) does not decrease in an iteration, when the step size is small. Each iteration is composed of SSIM gradient ascent and basic EGHS wi...
متن کاملA Theory on Flat Histogram Monte Carlo Algorithms
The flat histogram Monte Carlo algorithms have been successfully used in many problems in scientific computing.However, there is no a rigorous theory for the convergence of the algorithms. In this paper, a modified flat histogram algorithm is presented and its convergence is studied. The convergence of the multicanonical algorithm and the Wang-Landau algorithm is argued based on their relations...
متن کاملAlmost Sure Convergence Rates for the Estimation of a Covariance Operator for Negatively Associated Samples
Let {Xn, n >= 1} be a strictly stationary sequence of negatively associated random variables, with common continuous and bounded distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1,Xk+1) based on histogram type estimators as well as the estimation of the covariance function of the limit empirical process induced by the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Physics
دوره 228 شماره
صفحات -
تاریخ انتشار 2009